def fib(n):
    a,b=0,1
    while a<n:
        print(a)
        a,b=b,a+b

def fib1(n):
    result=[]
    a,b=0,1
    while a<n:
        result.append(a)
        a,b=b,a+b
    return result


#fib(10)
n=fib   #n will also work as fib function coz pyrhon asigns memory, its called renaming function
#n(20)

k=fib1(10)
#print(k)

def some(age,name="Amit"):
    print("Name= %s, Age= %d" % (name, age))

some(20)
some(10,"test")

def fun(i, k=[]):   #set k=none: if k is none k=[] (for no carry forward)
    k.append(i)
    return k

print(fun(4))
print(fun(5))
print(fun(6))   #list keeps the memory and carries forward